A self-stabilizing enumeration algorithm
نویسنده
چکیده
This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233–239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of a non-ambiguous topology for a network. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
A Local Self-stabilizing Enumeration Algorithm
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] presented the first self-stabilizing version of this algorithm which tolerates transient failures with an extension of messages complexity. Our version is based on local detection and correction of transient failures. ...
متن کاملA Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] presented the first self-stabilizing version of this algorithm which tolerates transient failures with an extension of messages complexity. Our version is based on local detection and correction of transient failures. ...
متن کاملEnumeration of Dominant Solutions: An Application in Transport Network Design
A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...
متن کاملCoset enumeration of groups generated by symmetric sets of involutions
The well-known Todd-Coxeter algorithm [14], which may be viewed as a means of constructing permutation representations of finitely presented groups, remains a primary reference for coset enumeration programs. All the strategies and variants of this algorithm perform essentially the same calculations as the original algorithm, merely choosing different orders in which to process the available in...
متن کاملCLF-based Nonlinear Control with Polytopic Input Constraints
This paper presents a practical method for generating high-performance control laws which are guaranteed to be stabilizing in the presence of known input constraints. We address the class of smooth nonlinear systems which are affine in the control with non-smooth (rectangular or polytopic) actuator constraints and a known control Lyapunov function. We present a result which uses a complete stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 82 شماره
صفحات -
تاریخ انتشار 2002